An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
نویسندگان
چکیده
منابع مشابه
A mixed integer linear formulation for the minimum label spanning tree problem
In this paper we deal with the minimum label spanning tree problem. This is a relevant problem with applications such as telecommunication networks or electric networks, where each edge is assigned with a label (such as a color) and it is intended to determine a spanning tree with the minimum number of different labels. We introduce some mixed integer formulations for this problem and prove tha...
متن کاملCombining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
We consider the generalized version of the classical Minimum Spanning Tree problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. We present a Variable Neighborhood Search (VNS) approach which uses three different neighborhood types. Two of them work in complementary ways in order to maximize search effectivity. Both are large ...
متن کاملA Mixed Integer Linear Programming Model for the Design of Remanufacturing Closed–loop Supply Chain Network
Closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. In this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. First, a mixed-integer linear programming formulation is developed to maximize the total profit. The main contribution...
متن کاملConstraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Given an undirected connected graph G = (V,E) with a set V of vertices, a set E of edges, and costs cij associated to every edge [i, j] ∈ E, with i < j, the Diameter Minimum Spanning Tree Problem (DCMST) consists in finding a minimum spanning tree T = (V,E ), with E ′ ⊆ E, where the diameter required does not exceed a given positive integer value D, where 2 ≤ D ≤ |V | − 1. The diameter of a tre...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2018
ISSN: 2227-7390
DOI: 10.3390/math6100183